s=input()
t=input()
vowel="aeiou"
flag=0
if(len(s)==len(t)):
for i in range(len(s)):
x=vowel.find(s[i])
y=vowel.find(t[i])
if((x == -1 and y == -1) or (x>=0 and y>=0)):
flag=1
continue
else:
flag=0
break
if(flag==0):
print("NO")
else:
print("YES")#include<iostream>
#include<cstring>
using namespace std;
int vowel(char c)
{
switch(c)
{
case 'a':
case 'e':
case 'i':
case 'o':
case 'u':
{
return 1;
break;
}
default:
{
return 0;
break;
}
}
}
int main()
{
char s[1005],t[1005];
bool flag=true;
cin>>s>>t;
if(strlen(s)!=strlen(t))
{
cout<<"No";
}
else
{
for(int i=0;i<(int)strlen(s);i++)
{
if(vowel(s[i])!=vowel(t[i]))
{
flag=false;
break;
}
}
if(flag)
{
cout<<"Yes";
}
else
{
cout<<"No";
}
}
return 0;
}
468. Validate IP Address | 450. Delete Node in a BST |
445. Add Two Numbers II | 442. Find All Duplicates in an Array |
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |